Double-Speed Safe Prime Generation

نویسنده

  • David Naccache
چکیده

Safe primes are prime numbers of the form p = 2q +1 where q is prime. This note introduces a simple method for doubling the speed of safe prime generation. The method is particularly suited to settings where a large number of RSA moduli must be generated. keywords : safe primes, key-generation, prime-generation, RSA.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Power Characteristics Analysis of a Novel Double-Stator Magnetic Geared Permanent Magnet Generator

This paper presents the design, fabrication and experimental power analysis of a novel double-stator magnetic geared permanent magnet (DSMGPM) machine which comprises of a doublestator permanent-magnet (PM) machine integrated a with triple rotor magnetic gear. The proposed machine can upscale the low-speed rotating magnetic field of the prime PMs on the prime rotor by using the modulation effec...

متن کامل

Safe Prime Generation with a Combined Sieve

A number p is a safe prime if both p and (p − 1)/2 are prime. This note describes a method of generating safe primes that is considerably faster than repeatedly generating random primes q until p = 2q + 1 is also prime.

متن کامل

Efficient Computation Modulo a Shared Secret with Application to the Generation of Shared Safe-Prime Products

We present a new protocol for efficient distributed computation modulo a shared secret. We further present a protocol to distributively generate a random shared prime or safe prime that is much more efficient than previously known methods. This allows to distributively compute shared RSA keys, where the modulus is the product of two safe primes, much more efficiently than was previously known.

متن کامل

Prime Number Generation Based On Pocklington's Theorem

Public-key cryptosystems base their security on well-known number-theoretic problems, such as factorisation of a given number n. Hence, prime number generation is an absolute requirement. Many prime number generation techniques have been proposed up-to-date, which differ mainly in terms of complexity, certainty and speed. Pocklington’s theorem, if implemented, can guarantee the generation of a ...

متن کامل

High Speed Delay-Locked Loop for Multiple Clock Phase Generation

In this paper, a high speed delay-locked loop (DLL) architecture ispresented which can be employed in high frequency applications. In order to design the new architecture, a new mixed structure is presented for phase detector (PD) and charge pump (CP) which canbe triggered by double edges of the input signals. In addition, the blind zone is removed due to the elimination of reset signal. Theref...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IACR Cryptology ePrint Archive

دوره 2003  شماره 

صفحات  -

تاریخ انتشار 2003